Counting Maximal Antichains and Independent Sets
نویسندگان
چکیده
منابع مشابه
Counting maximal distance-independent sets in grid graphs
Previous work on counting maximal independent sets for paths and certain 2-dimensional grids is extended in two directions: 3-dimensional grid graphs are included and, for some/any l ∈ N, maximal distance-l independent (or simply: maximal l-independent) sets are counted for some grids. The transfer matrix method has been adapted and successfully applied.
متن کاملCounting independent sets in graphs
In this short survey article, we present an elementary, yet quite powerful, method of enumerating independent sets in graphs. This method was first employed more than three decades ago by Kleitman and Winston and has subsequently been used numerous times by many researchers in various contexts. Our presentation of the method is illustrated with several applications of it to ‘real-life’ combinat...
متن کاملCounting Independent Sets in Hypergraphs
Let G be a triangle-free graph with n vertices and average degree t. We show that G contains at least e(1−n −1/12) 1 2 n t ln t( 1 2 ln t−1) independent sets. This improves a recent result of the first and third authors [8]. In particular, it implies that as n → ∞, every triangle-free graph on n vertices has at least e(c1−o(1)) √ n lnn independent sets, where c1 = √ ln 2/4 = 0.208138... Further...
متن کاملMaximal Antichains of Minimum Size
Let n > 4 be a natural number, and let K be a set K ⊆ [n] := {1, 2, . . . , n}. We study the problem to find the smallest possible size of a maximal family A of subsets of [n] such that A contains only sets whose size is in K, and A 6⊆ B for all {A,B} ⊆ A, i.e. A is an antichain. We present a general construction of such antichains for sets K containing 2, but not 1. If 3 ∈ K our construction a...
متن کاملMaximal Independent Sets and Separating Covers
In 1973, Katona raised the problem of determining the maximum number of subsets in a separating cover on n elements. The answer to Katona’s question turns out to be the inverse to the answer to a much simpler question: what is the largest integer which is the product of positive integers with sum n? We give a combinatorial explanation for this relationship, via Moon and Moser’s answer to a ques...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Order
سال: 2012
ISSN: 0167-8094,1572-9273
DOI: 10.1007/s11083-012-9253-5